31![Lattice-based Cryptography Oded Regev? Tel Aviv University, Israel Abstract. We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with Lattice-based Cryptography Oded Regev? Tel Aviv University, Israel Abstract. We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with](https://www.pdfsearch.io/img/8103fb3e15afc5a82bf7ba82a8d04064.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2008-09-15 00:54:55
|
---|
32![On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem has On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem has](https://www.pdfsearch.io/img/0b3aaf2bbab847e31f54f68b4e4da3ae.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-19 12:06:15
|
---|
33![Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR Tancrède Lepoint1 and Mehdi Tibouchi2 2 1 Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR Tancrède Lepoint1 and Mehdi Tibouchi2 2 1](https://www.pdfsearch.io/img/b9064cb6e732b501b3a66e76107d96c5.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-09 03:49:32
|
---|
34![Non-Abelian Analogs of Lattice Rounding Evgeni Begelfor Department of Computer Science The Hebrew University of Jerusalem [removed] Stephen D. Miller∗ Non-Abelian Analogs of Lattice Rounding Evgeni Begelfor Department of Computer Science The Hebrew University of Jerusalem [removed] Stephen D. Miller∗](https://www.pdfsearch.io/img/6156a3037694b9f9c914fd3546d02dd2.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-11 23:40:13
|
---|
35![BKZ 2.0: Better Lattice Security Estimates Yuanmi Chen and Phong Q. Nguyen 1 2 BKZ 2.0: Better Lattice Security Estimates Yuanmi Chen and Phong Q. Nguyen 1 2](https://www.pdfsearch.io/img/53047b77e4ef0504129a4d4ace1078de.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2014-01-05 23:20:01
|
---|
36![Lattice Enumeration using Extreme Pruning Nicolas Gama1 , Phong Q. Nguyen2 , and Oded Regev3 1 GREYC and ENSICAEN, France. INRIA and ENS, France. http://www.di.ens.fr/~pnguyen/. Lattice Enumeration using Extreme Pruning Nicolas Gama1 , Phong Q. Nguyen2 , and Oded Regev3 1 GREYC and ENSICAEN, France. INRIA and ENS, France. http://www.di.ens.fr/~pnguyen/.](https://www.pdfsearch.io/img/8e5503b15b40b7dfd2b6231d4ef2a140.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2012-07-19 15:34:39
|
---|
37![
!
!](https://www.pdfsearch.io/img/acae472a29659c358ccc2c22968e2ee5.jpg) | Add to Reading ListSource URL: www.ctc.gov.kwLanguage: English - Date: 2014-07-17 03:44:40
|
---|
38![Partial LLL Reduction Xiaohu Xie Xiao-Wen Chang Mazen Al Borno Partial LLL Reduction Xiaohu Xie Xiao-Wen Chang Mazen Al Borno](https://www.pdfsearch.io/img/6232a5d170c182a49080ba1029011093.jpg) | Add to Reading ListSource URL: www.cs.mcgill.caLanguage: English - Date: 2011-08-29 23:51:55
|
---|
39![Fast Lattice Point Enumeration with Minimal Overhead∗ Daniele Micciancio UCSD [removed] Michael Walter Fast Lattice Point Enumeration with Minimal Overhead∗ Daniele Micciancio UCSD [removed] Michael Walter](https://www.pdfsearch.io/img/1a50b055efdec18fe804ad1f5f81c670.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2014-08-07 13:48:08
|
---|